Key Establishment Protocols and Timed-Release Encryption Schemes

نویسندگان

  • Qiang Tang
  • Liqun Chen
  • Zhaohui Cheng
چکیده

This thesis is divided into two distinct parts. The first part of the thesis explores security issues in key establishment protocols, including both key distribution protocols and key agreement protocols, and in both the general and the password-based setting. The second part of the thesis explores security issues of Timed-Release encryption schemes, especially those with a Pre-Open capability. In the first part, we initially present a formal description of key establishment protocols, and summarise the security properties that may be required of such a protocol. Secondly, we examine existing security models for key establishment protocols. We show that none of these security models fully capture the desired security properties. Thirdly, we examine some existing protocols and demonstrate certain vulnerabilities. Some of these vulnerabilities have not previously been detected because of the lack of a formal security analysis, while others have been missed because the adopted security models fail to address such security vulnerabilities. Fourthly, we describe a novel security model for general key establishment protocols, and we further adapt it for the password setting. Finally, we propose key establishment protocols which are proved secure in our novel security model. In the second part we start by examining an existing security model for TimedRelease Encryption schemes with a Pre-open Capability (TRE-PC), and we demonstrate several limitations of this model. We then propose a new security model for such public-key encryption schemes, and establish relationships between the proposed security notions. We also propose a general construction for TRE-PC schemes and an instantiation of certain primitives.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Timed Release Cryptography from Bilinear Pairings Using Hash Chains

We propose a new Timed Release Cryptography (TRC) scheme which is based on bilinear pairings together with an S/Key-like procedure used for private key generation. Existing schemes for this task, such as time-lock puzzle approach, provide an approximate release time, dependent on the recipients’ CPU speed and the beginning time of the decryption process. Additionally, some other server-based sc...

متن کامل

Scalable, Server-Passive, User-Anonymous Timed Release Public Key Encryption from Bilinear Pairing

We consider the problem of sending messages into the future, commonly known as timed release cryptography. Existing schemes for this task either solve the relative time problem with uncontrollable, coarse-grained release time (time-lock puzzle approach) or do not provide anonymity to sender and/or receiver and are not scalable (server-based approach). Using a bilinear paring on any Gap Diffie-H...

متن کامل

Efficient Generic Constructions of Timed-Release Encryption with Pre-open Capability

Timed-release encryption with pre-open capability (TRE-PC), introduced by Hwang et al. in 2005, is a cryptosystem with which a sender can make a ciphertext so that a receiver can decrypt it by using a timed-release key provided from a trusted time-server, or by using a special information called pre-open key provided from the sender before the release-time, and thus adds flexibility to ordinary...

متن کامل

A Timed-Release Proxy Re-encryption Scheme and Its Application to Fairly-Opened Multicast Communication

Timed-Release Encryption (TRE) (proposed by May in 1993) prevents even a legitimate recipient decrypting a ciphertext before a semi-trusted Time Server (TS) sends trapdoor sT assigned with a release time T of the encryptor’s choice. Cathalo et al. (ICICS2005) and Chalkias et al. (ESORICS2007) have already considered encrypting a message intended to multiple recipients with the same release time...

متن کامل

Weaknesses of the Boyd-Mao Deniable Authenticated key Establishment for Internet Protocols

In 2003, Boyd and Mao proposed two deniable authenticated key establishment protocols using elliptic curve pairings for Internet protocols, one is based on Diffie-Hellman key exchange and the other is based on Public-Key Encryption approach. For the use of elliptic curve pairings, they declared that their schemes could be more efficient than the existing Internet Key Exchange (IKE), nowadays. H...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007